Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
نویسندگان
چکیده
منابع مشابه
An Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملOptimization over k-set Polytopes and Efficient k-set Enumeration
We present two versions of an algorithm based on the reverse search technique for enumerating all k-sets of a point set in R d. The key elements include the notion of a k-set polytope and the optimization of a linear function over a k-set polytope.
متن کاملFOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملAn Efficient Algorithm for Computing the Generalized Null Space Decomposition
The generalized null space decomposition (GNSD) is a unitary reduction of a general matrix A of order n to a block upper triangular form that reveals the structure of the Jordan blocks of A corresponding to a zero eigenvalue. The reduction was introduced by Kublanovskaya. It was extended first by Ruhe and then by Golub and Wilkinson, who based the reduction on the singular value decomposition. ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial and Management Optimization
سال: 2016
ISSN: 1547-5816
DOI: 10.3934/jimo.2016.12.1417